precedence parser造句
例句與造句
- An operator-precedence parser can do the same more efficiently.
- Precedence parsers are limited in the grammars they can handle.
- The shunting-yard algorithm is commonly used to implement operator-precedence parsers.
- Edsger Dijkstra's shunting yard algorithm is commonly used to implement operator precedence parsers.
- The algorithm is not a pure operator-precedence parser like the Dijkstra shunting yard algorithm.
- It's difficult to find precedence parser in a sentence. 用precedence parser造句挺難的
- Perl 6 sandwiches an operator-precedence parser between two Recursive descent parsers in order to achieve a balance of speed and dynamism.
- Operator precedence parsers are also embedded within compiler compiler-generated parsers to noticeably speed up the recursive descent approach to expression parsing.
- An operator-precedence parser is a simple shift-reduce parser that is capable of parsing a subset of LR ( 1 ) grammars.
- Operator-precedence parsers are not used often in practice; however they do have some properties that make them useful within a larger design.
- :One use of ?" and ?" is in precedence tables for simple precedence parsers .-- Lambiam 04 : 21, 26 May 2008 ( UTC)
- More precisely, the operator-precedence parser can parse all LR ( 1 ) grammars where two consecutive nonterminals and epsilon never appear in the right-hand side of any rule.
- Most operator-precedence parsers can be modified to produce postfix expressions; in particular, once an abstract syntax tree has been constructed, the corresponding postfix expression is given by a simple post-order traversal of that tree.
- The Weber relationship between a pair of symbols ( V _ t \ cup V _ n ) is necessary to determine if a formal grammar is a simple precedence grammar, and in such case the simple precedence parser can be used.
- This is expressed in the virtual machine for Perl 6, GCC's C and C + + parsers, which are hand-coded recursive descent parsers, are both speed up by an operator-precedence parser that can quickly examine arithmetic expressions.
- Parrot provides a suite of compiler-writing tools which includes the Parser Grammar Engine ( PGE ), a hybrid parser-generator that can express a recursive descent parser as well as an operator-precedence parser, allowing free transition between the two in a single grammar.
更多例句: 下一頁